Quantum search for scaled hash function preimages

Abstract We present the implementation of Grover’s algorithm in a quantum simulator to perform search for preimages two scaled hash functions, whose design only uses modular addition, word rotation and bitwise exclusive or. Our provides means assess with precision scaling number gates depth full-fledged circuit designed find given digest. The detailed construction oracle shows that presence AND gates, OR shifts bits reuse initial state along computation require extra resources as compared other functions based on additions, XOR rotations. also track entanglement entropy register at every step computation, showing it becomes maximal inner core first action oracle, which implies no classical simulation tensor networks would be relevance. Finally, we show strategies suggest shortcut sampling after few steps can provide some marginal practical advantage terms error mitigation.